Reducibility among Scheduling Classes
نویسنده
چکیده
منابع مشابه
Width-Bounded Reducibility and Binary Search over Complexity Classes
We introduce a notion of width-bounded reducibility. Width-bounded reducibility provides a circuit-based realization of RuzzoSimon-Tompa reducibility [RS-84], and allows us to generalize that notion of reducibility. We show that reductions of simultaneously restricted width and depth provide a characterization of binary search over complexity classes, as introduced by Wagner [Wa-89] and Buss an...
متن کاملOn Polynomial-Time Relation Reducibility
We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ ...
متن کاملL1-Computability, Layerwise Computability and Solovay Reducibility
We propose a hierarchy of classes of functions that corresponds to the hierarchy of randomness notions. Each class of functions converges at the corresponding random points. We give various characterizations of the classes, that is, characterizations via integral tests, L-computability and layerwise computability. Furthermore, the relation among these classes is formulated using a version of So...
متن کاملGame characterizations of function classes and Weihrauch degrees
Games are an important tool in mathematics and logic, providing a clear and intuitive understanding of the notions they define or characterize. In particular, since the seminal work of Wadge in the 1970s, game characterizations of classes of functions in Baire space have been a rich area of research, having had significant and far-reaching development by van Wesep, Andretta, Duparc, Motto Ros, ...
متن کاملClasses of Structures with no Intermediate Isomorphism Problems
We say that a theory T is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence T is uniformly effectively dense, a property we define in the paper, then no extension of it is intermediate, at least when relativized to every oracle on a cone. As...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004